Parallelism Constraints
نویسندگان
چکیده
Parallelism constraints are logical desciptions of trees. They are as expressive as context unification, i.e. second-order linear unification. We present a semi-decision procedure enumerating all “most general unifiers” of a parallelism constraint and prove it sound and complete. In contrast to all known procedures for context unification, the presented procedure terminates for the important fragment of dominance constraints and performs reasonably well in a recent application to underspecified natural language semantics.
منابع مشابه
Parallelism and Tree Regular Constraints
Parallelism constraints are logical descriptions of trees. Parallelism constraints subsume dominance constraints and are equal in expressive power to context unification. Parallelism constraints belong to the constraint language for lambda structures (CLLS) which serves for modeling natural language semantics. In this paper, we investigate the extension of parallelism constraints by tree regula...
متن کاملA Study of the Role of Repetition of Music in the Nimayee Poems of Akhavan Sales
In this article, the aim of the authors is to study the role of repetition in creating music and parallelism in Nimayee poems in the three collections of poems by Mehdi Akhavan Sales: Zamestan, Akhere Shahname and Az Avesta. Accordingly, the researchers have investigated the various manners of repetition in creating parallelism in the poems at three levels: phonological parallelism, lexical par...
متن کاملDescribing Lambda Terms in Context Unification
The constraint language for lambda structures (CLLS) is a description language for lambda terms. CLLS provides parallelism constraints to talk about the tree structure of lambda terms, and lambda binding constraints to specify variable binding. Parallelism constraints alone have the same expressiveness as context unification. In this paper, we show that lambda binding constraints can also be ex...
متن کاملBeta Reduction Constraints
The constraint language for lambda structures (CLLS) can model lambda terms that are known only partially. In this paper, we introduce beta reduction constraints to describe beta reduction steps between partially known lambda terms. We show that beta reduction constraints can be expressed in an extension of CLLS by group parallelism. We then extend a known semi-decision procedure for CLLS to al...
متن کاملGraph Structure Management in Parallel Symbolic Systems
We discuss the efficient exploitation of parallelism in systems where a common data structure is accessed, using message-passing, by a set of parallel processes. In particular, we provide a framework in which such systems can be abstractly represented and present a range of definitions in terms of constraints upon the available parallelism. In addition to considering a particular class of probl...
متن کامل